1566A - Median Maximization - CodeForces Solution


binary search greedy math *800

Please click on ads to support us..

Python Code:

for _ in range(int(input())):
    n, s = input().split()
    print(int(s) // ((int(n) + 2) // 2))

C++ Code:

#include <bits/stdc++.h>        
using namespace std;
int main(){
    int t=1;cin>>t;
    while(t--){
        int a,b; cin>>a>>b;
        cout<<b/(a/2+1)<<endl;
        
    }
    
}


Comments

Submit
0 Comments
More Questions

287A - IQ Test
1108A - Two distinct points
1064A - Make a triangle
1245C - Constanze's Machine
1005A - Tanya and Stairways
1663F - In Every Generation
1108B - Divisors of Two Integers
1175A - From Hero to Zero
1141A - Game 23
1401B - Ternary Sequence
598A - Tricky Sum
519A - A and B and Chess
725B - Food on the Plane
154B - Colliders
127B - Canvas Frames
107B - Basketball Team
245A - System Administrator
698A - Vacations
1216B - Shooting
368B - Sereja and Suffixes
1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM
118D - Caesar's Legions
1598A - Computer Game
1605A - AM Deviation